<HTML><HEAD>
<META NAME="description" CONTENT="Priority queues implemented as heaps">
<META NAME="names" CONTENT="sorted_priority_queue, dispenser, heap">
<META NAME="legal" CONTENT="See notice at end of class.">
<META NAME="contents" CONTENT="generic">
<META NAME="access" CONTENT="fixed, membership">
<META NAME="representation" CONTENT="heap">
<META NAME="keywords" CONTENT="Eiffel class">
<META NAME="license" CONTENT="Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)">
<META NAME="copyright" CONTENT="Copyright (c) 1984-2006, Eiffel Software and others">
<META NAME="source" CONTENT="Eiffel Software 356 Storke Road, Goleta, CA 93117 USA Telephone 805-685-1006, Fax 805-685-6869 Website http://www.eiffel.com Customer support http://support.eiffel.com">
<META NAME="library" CONTENT="EiffelBase: Library of reusable components for Eiffel.">
<META NAME="keywords" CONTENT="Eiffel class">
<TITLE>heap_priority_queue Chart</TITLE></HEAD>
<BODY BGCOLOR="white">
<P ALIGN="CENTER">Automatic generation produced by ISE Eiffel</P>
<PRE><TABLE BORDER="1" ALIGN="CENTER"><TR><TD><A HREF="../class_list.html">Classes</A></TD><TD><A HREF="../cluster_list.html">Clusters</A></TD><TD><A HREF="../cluster_hierarchy.html">Cluster hierarchy</A></TD><TD>Chart</TD><TD><A HREF="heap_priority_queue_links.html">Relations</A></TD><TD><A HREF="heap_priority_queue_flatshort.html">Flat contracts</A></TD></TR></TABLE><B>class</B>
    <A HREF="../base/heap_priority_queue_chart.html">HEAP_PRIORITY_QUEUE</A> [G -&gt; <A HREF="../base/comparable_chart.html">COMPARABLE</A>]

<B>General</B>
    cluster: elks
    description: "Priority queues implemented as heaps"
    create: <A HREF="../base/heap_priority_queue_flatshort.html#f_make">make</A>

<B>Ancestors</B>
    <A HREF="../base/array_chart.html">ARRAY</A> [G]
    <A HREF="../base/priority_queue_chart.html">PRIORITY_QUEUE</A>* [G -&gt; <A HREF="../base/part_comparable_chart.html">PART_COMPARABLE</A>]

<B>Queries</B>
    <A HREF="../base/container_flatshort.html#f_changeable_comparison_criterion">changeable_comparison_criterion</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A><FONT COLOR="red"> -- (from CONTAINER)</FONT>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_count">count</A>: <A HREF="../base/integer_32_chart.html">INTEGER_32</A>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_duplicate">duplicate</A> (n: <A HREF="../base/integer_32_chart.html">INTEGER_32</A>): [<B>like</B> <B>Current</B>] <A HREF="../base/heap_priority_queue_chart.html">HEAP_PRIORITY_QUEUE</A> [G]
    <A HREF="../base/heap_priority_queue_flatshort.html#f_extendible">extendible</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_full">full</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A>
    <A HREF="../base/array_flatshort.html#f_has">has</A> (v: G): <A HREF="../base/boolean_chart.html">BOOLEAN</A><FONT COLOR="red"> -- (from ARRAY)</FONT>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_index_set">index_set</A>: <A HREF="../base/integer_interval_chart.html">INTEGER_INTERVAL</A>
    <A HREF="../base/finite_flatshort.html#f_is_empty">is_empty</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A><FONT COLOR="red"> -- (from FINITE)</FONT>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_is_equal">is_equal</A> (other: [<B>like</B> <B>Current</B>] <A HREF="../base/heap_priority_queue_chart.html">HEAP_PRIORITY_QUEUE</A> [G]): <A HREF="../base/boolean_chart.html">BOOLEAN</A>
    <A HREF="../base/collection_flatshort.html#f_is_inserted">is_inserted</A> (v: G): <A HREF="../base/boolean_chart.html">BOOLEAN</A><FONT COLOR="red"> -- (from COLLECTION)</FONT>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_item">item</A>: G
    <A HREF="../base/heap_priority_queue_flatshort.html#f_linear_representation">linear_representation</A>: <A HREF="../base/arrayed_list_chart.html">ARRAYED_LIST</A> [G]
    <A HREF="../base/container_flatshort.html#f_object_comparison">object_comparison</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A><FONT COLOR="red"> -- (from CONTAINER)</FONT>
    <A HREF="../base/array_flatshort.html#f_occurrences">occurrences</A> (v: G): <A HREF="../base/integer_32_chart.html">INTEGER_32</A><FONT COLOR="red"> -- (from ARRAY)</FONT>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_prunable">Prunable</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A>
    <A HREF="../base/dispenser_flatshort.html#f_readable">readable</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A><FONT COLOR="red"> -- (from DISPENSER)</FONT>
    <A HREF="../base/dispenser_flatshort.html#f_writable">writable</A>: <A HREF="../base/boolean_chart.html">BOOLEAN</A><FONT COLOR="red"> -- (from DISPENSER)</FONT>

<B>Commands</B>
    <A HREF="../base/dispenser_flatshort.html#f_append">append</A> (s: <A HREF="../base/sequence_chart.html">SEQUENCE</A> [G])<FONT COLOR="red"> -- (from DISPENSER)</FONT>
    <A HREF="../base/container_flatshort.html#f_compare_objects">compare_objects</A><FONT COLOR="red"> -- (from CONTAINER)</FONT>
    <A HREF="../base/container_flatshort.html#f_compare_references">compare_references</A><FONT COLOR="red"> -- (from CONTAINER)</FONT>
    <A HREF="../base/array_flatshort.html#f_copy">copy</A> (other: [<B>like</B> <B>Current</B>] <A HREF="../base/heap_priority_queue_chart.html">HEAP_PRIORITY_QUEUE</A> [G])<FONT COLOR="red"> -- (from ARRAY)</FONT>
    <A HREF="../base/array_flatshort.html#f_extend">extend</A> (v: G)<FONT COLOR="red"> -- (from ARRAY)</FONT>
    <A HREF="../base/collection_flatshort.html#f_fill">fill</A> (other: <A HREF="../base/container_chart.html">CONTAINER</A> [G])<FONT COLOR="red"> -- (from COLLECTION)</FONT>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_force">force</A> (v: [<B>like</B> <A HREF="../base/heap_priority_queue_flatshort.html#f_item">item</A>] G)
    <A HREF="../base/heap_priority_queue_flatshort.html#f_make">make</A> (n: <A HREF="../base/integer_32_chart.html">INTEGER_32</A>)
    <A HREF="../base/heap_priority_queue_flatshort.html#f_prune">prune</A> (v: G)
    <A HREF="../base/collection_flatshort.html#f_prune_all">prune_all</A> (v: G)<FONT COLOR="red"> -- (from COLLECTION)</FONT>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_put">put</A> (v: [<B>like</B> <A HREF="../base/heap_priority_queue_flatshort.html#f_item">item</A>] G)
    <A HREF="../base/heap_priority_queue_flatshort.html#f_remove">remove</A>
    <A HREF="../base/heap_priority_queue_flatshort.html#f_wipe_out">wipe_out</A>

<B>Constraints</B>
    empty means storage empty

<TABLE BORDER="1" ALIGN="CENTER"><TR><TD><A HREF="../class_list.html">Classes</A></TD><TD><A HREF="../cluster_list.html">Clusters</A></TD><TD><A HREF="../cluster_hierarchy.html">Cluster hierarchy</A></TD><TD>Chart</TD><TD><A HREF="heap_priority_queue_links.html">Relations</A></TD><TD><A HREF="heap_priority_queue_flatshort.html">Flat contracts</A></TD></TR></TABLE></PRE>
<P ALIGN="CENTER"> &#045;&#045; Generated by ISE Eiffel &#045;&#045 </P>
<P ALIGN="CENTER">For more details: <A HREF="http://www.eiffel.com">www.eiffel.com</A></P>
</BODY>
</HTML>
